var a = new Array(8)
for(let i =0;i<a.length;i++){
  a[i] = new Array(8)
}
//数组嵌套数组这么理解



//二维拓扑结构
// 不关注 大小 距离 位置 
// 只关注 关系
// 衍生出来 二叉树 

function Node(value) {
  this.value = value;
  this.neighbor = [];
}

var a = new Node("a");
var b = new Node("b");
var c = new Node("c");
var d = new Node("d");
var e = new Node("e");
var f = new Node("f");

a.neighbor.push(b);
a.neighbor.push(c);
a.neighbor.push(f);
b.neighbor.push(a);
b.neighbor.push(d);
b.neighbor.push(e);
c.neighbor.push(a);
d.neighbor.push(b);
e.neighbor.push(b);

console.log(a)